package erfen;

import java.util.Vector;

public class Solution_35 {
    public int searchInsert(int[] nums, int target) {
        int left=0,right=nums.length-1;
        while (left<=right){
            int mid=(left+right)>>>1;
            if(nums[mid]>=target)
                right=mid-1;
            else left=mid+1;
        }
        return left;
    }
}
